Game Theoretic Request Scheduling with Queue Priority in Video Sensor Networks
نویسندگان
چکیده
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملPriority Based Packet Scheduling Scheme in Wireless Sensor Networks
A network consisting of distributed autonomous sensors to cooperatively monitor physical or environmental conditions such as s o u n d , temperature, p r e s s u r e , pollutants and etc. is called as a wireless sensor network (WSN). The origin of wireless sensor networks was motivated by defense applications i.e. battlefield surveillance. However, WSNs are now used in many commercial and civil...
متن کاملPriority based Packet Scheduling Approach for Wireless Sensor Networks
A priority based packet scheduling scheme is proposed which aims at scheduling different types of data packets, such as real time and non-real-time data packets at sensor nodes with resource constraints in Wireless Sensor Networks. Most of the existing packet-scheduling mechanisms of Wireless Sensor Networks use First Come First Served (FCFS), non-preemptive priority and preemptive priority sch...
متن کاملEnergy and Priority Aware Scheduling Scheme for Wireless Sensor Networks
Wireless sensor networks (WSNs) are playing a vital role in automation, sensing and commercial applications. Key issues in WSNs are to satisfy Quality of service (QoS) parameters and to conserve energy. Some of the sensor nodes in WSN act as a single communication link to connect one group of sensor nodes to other in multi-hop environment. If nodes acting as a single communication link become d...
متن کاملEfficient Dynamic Multilevel Priority Task Scheduling For Wireless Sensor Networks
ABSTRACT: Most of the existing packet-scheduling mechanism of WSN use First Come First Served(FCFS),nonpreemptive priority and preemptive prior it scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2014
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2014/572524